Translation from classical two-way automata to pebble two-way automata
نویسندگان
چکیده
منابع مشابه
Translation from classical two-way automata to pebble two-way automata
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional “pebble” movable along the input tape. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial trade-off, in the number of states, between the nondeterministic and deterministic pebble two-way automata. Ho...
متن کاملThe Reduction of Two-Way Automata to One-Way Automata
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.
متن کاملDeterminizing Two-way Alternating Pebble Automata for Data Languages
We prove that for every integer k ≥ 1, two-way alternating kpebble automata and one-way deterministic k-pebble automata for data languages have the same recognition power.
متن کاملTwo-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملTropical Two-Way Automata
In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance automata. In the second part of the paper we show that, with general min-plus semirings, it is decidable whether every accepted word has a weight different from −∞ and that, in contrast, it is undecidable whether there exists a word accepted with a weight different from −∞.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2010
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2011001